Hardy Cross and the “Moment Distribution Method”
نویسندگان
چکیده
منابع مشابه
Hydraulic Analysis of Water Supply Networks using a Modified Hardy Cross Method
There are different methods for the hydraulic analysis of water supply networks. In the solution process of most of these methods, a large system of linear equations is solved in each iteration. This usually requires a high computational effort. Hardy Cross method is one of the approaches that do not need such a process and may converge to the solution through scalar divisions. However, this me...
متن کاملMethod of L-moment estimation for the generalized lambda distribution
The generalized lambda distribution (GLD) is a flexible distribution for statistical modelling, but existing estimation methodologies for the GLD are computationally difficult, rendering the GLD impractical for many practitioners. We derive a parameterization of the GLD with closed-form expressions for the method of L-moment estimators. A numerical example involving the age of coronary heart di...
متن کاملImplementation of the Hardy-Cross method for the solution of piping networks
This paper describes a user-friendly software for the calculation of general piping system networks composed of virtually any parallel and series pipe arrangement. Solution of the network is made with recourse to the iterative method of Hardy Cross. Solution is provided for pressure and flow-rate in each branch. Dimensioning problems, where pump characteristics or a pipe diameter are sought for...
متن کاملGeneralising the Hardy-Littlewood method for primes
The Hardy-Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov’s 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of Chowla and Van der Corput giving an asymptotic for the number of 3-term progressions of primes, all less than N . This article surveys recent developments of the...
متن کاملApplications of the Hardy - Littlewood Circle Method
1 Waring’s Problem Problem 1. (Waring’s) For every natural number k ≥ 2 there exists a positive integer s such that every natural number is the sum of at most s k powers of natural number (for example, every natural number is the sum of at most 4 squares, or 9 cubes, or 19 fourth powers, etc.). The affirmative answer, known as the Hilbert-Waring theorem, was provided by Hilbert in 1909. Let A =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nexus Network Journal
سال: 2001
ISSN: 1590-5896,1522-4600
DOI: 10.1007/s00004-001-0020-y